منابع مشابه
Descent Sets for Symplectic Groups
The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role in the representation theory of the symplectic groups as the descent set of a standard tableau plays in the representation theory of the general linear groups. In particular, we show that the descent set is preserved by Sundaram's correspondence. This gives a direct combinatorial interpret...
متن کاملOn descent for coalgebras and type transformations
We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...
متن کاملHandwritten Character Recognition using Modified Gradient Descent Technique of Neural Networks and Representation of Conjugate Descent for Training Patterns
The purpose of this study is to analyze the performance of Back propagation algorithm with changing training patterns and the second momentum term in feed forward neural networks. This analysis is conducted on 250 different words of three small letters from the English alphabet. These words are presented to two vertical segmentation programs which are designed in MATLAB and based on portions (1...
متن کاملPenalized Bregman Divergence Estimation via Coordinate Descent
Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, et al. (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, et al. (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores...
متن کاملThe field descent and class groups of CM -fields
We consider the following “field descent problem” for principal ideals I of number fields K. Assume that I is invariant under a Galois automorphism σ of K; decide wether there is a generator g of I with gσ = g, i.e., wether I can be generated by an element of Fix σ. We solve this problem for certain ideals by elementary methods. As a consequence, we are able to exhibit large explicit subgroups ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Anthropologist
سال: 1959
ISSN: 0002-7294,1548-1433
DOI: 10.1525/aa.1959.61.4.02a00010